Knots with g(E(K)) = 2 and g(E(K#K#K)) = 6 and Morimoto’s Conjecture
نویسنده
چکیده
We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respectively (we follow the definitions and notations given in [7]). It is well known that the union of a tunnel system for K1, a tunnel system for K2, and a tunnel on a decomposing annulus for K1#K2 forms a tunnel system for K1#K2. Therefore: t(K1#K2) ≤ t(K1) + t(K2) + 1. Since (for any knot K) t(K) = g(E(K))− 1 this gives: (1) g(E(K1#K2)) ≤ g(E(K1)) + g(E(K2)). We say that a knot K in a closed orientable manifold M admits a (g, n) position if there exists a genus g Heegaard surface Σ ⊂ M , separating M into the handlebodies H1 and H2, so that Hi ∩K (i = 1, 2) consists of n arcs that are simultaneously parallel into ∂Hi. It is known [10, Proposition 1.3] that if Ki (i = 1 or 2) admits a (t(Ki), 1) position then equality does not hold: g(E(K1#K2)) < g(E(K1)) + g(E(K2)). Morimoto proved that if K1 and K2 are m-small knots then the converse holds, and conjectured that this holds in general [10, Conjecture 1.5]: Conjecture 1 (Morimoto’s Conjecture). Given knots K1, K2 ⊂ S, g(E(K1#K2)) < g(E(K1)) + g(E(K2)) if and only if for i = 1 or i = 2, Ki admits a (t(Ki), 1) position. We denote the connected sum of n copies of K by nK. We prove: Date: February 2, 2008. 1991 Mathematics Subject Classification. 57M99.
منابع مشابه
Knots with g(E(K)) = 2 and . . .
We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respecti...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کامل$L^p$-Conjecture on Hypergroups
In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions for a weighted Lebesgue space $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$. Among the other things, we also show that if $K$ is a locally compact hyper...
متن کامل